Extending Horn clause logic with implication goals
نویسندگان
چکیده
منابع مشابه
Extending Horn Clause Theories by Reflection Principles
In this paper, we introduce logical reeection as a principled way to empower the representation and reasoning capabilities of logic programming systems. In particular, reeection principles take the role of axiom schemata of a particular form that, once added to a given logic program (the basic theory, or the initial axioms), enlarge the set of consequences sanctioned by those initial axioms. Th...
متن کاملTranslating a Modal Language with Embedded Implication into Horn Clause Logic
In this paper we present a method for translating Horn clauses extended with modalities and embedded implication (which provide reasoning capabilities in a multiagent situation and hypothetical reasoning) into Horn clauses, therefore suitable for SLD resolution. The translation takes two steps: the rst one eliminates embedded implications by introducing new modalities; the second eliminates mod...
متن کاملMeta-Programming for Generalized Horn Clause Logic
In conventional logic programming systems, control information is expressed by clause and goal order and by purely procedural constructs, e.g., the Prolog cut. This approach destroys the equivalence of declarative and procedural semantics in logic programs. In this paper, we argue that in order to comply with the logic programming paradigm, control information should also be expressed declarati...
متن کاملUndecidability of the Horn Clause Finite Implication Problem ?
We prove that the set IMPL of such pairs < H; G > of Horn clauses, that H nitely implies G (i.e. G is true in all the nite structures in which H is true), is not recursive. Moreover, we prove that sets co-IMP L and RES=f< H; G > G can be derived from H by resolution g are recursively inseparable.
متن کاملExtending the Description Horn Logic DHL
We extend the description Horn logic DHL [5], which is a fragment of the description logic SHI, to a fragment EDHL of the context-free description logic with inverse roles ALCIcf . We show that the instance checking problem in EDHL has PTime data complexity. Combining EDHL with Datalog we obtain the query language EDHL-Datalog with PTime data complexity. We introduce and study also the general ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1992
ISSN: 0304-3975
DOI: 10.1016/0304-3975(92)90066-o